Infinite-vertex Free Profinite Semigroupoids and Symbolic Dynamics
نویسندگان
چکیده
Some fundamental questions about infinite-vertex (free) profinite semigroupoids are clarified, putting in evidence differences with the finitevertex case. This is done with examples of free profinite semigroupoids generated by the graph of a subshift. It is also proved that for minimal subshifts, the infinite edges of such free profinite semigroupoids form a connected compact groupoid.
منابع مشابه
Symbolic Dynamics in Free Profinite Semigroups
This is a survey and announcement of recent results on the structure of free profinite semigroups using techniques and results from symbolic dynamics. The intimate connection between uniformly recurrent infinite words and J -maximal regular J -classes is explored to compute the maximal subgroups of the J -classes associated with Arnoux-Rauzy infinite words, which turn out to be free profinite g...
متن کاملA Combinatorial Property of Ideals in Free Profinite Monoids
The second statement of Corollary 3 was first proved by Almeida and Volkov using techniques coming from symbolic dynamics [2]. Our next result generalizes a result of Rhodes and the author showing that all elements of finite order in F̂V(A) are group elements, which played a key role in proving that such elements are in fact idempotent [7]. Let N̂ denote the profinite completion of the monoid of ...
متن کاملProfinite semigroups
We present a survey of results on profinite semigroups and their link with symbolic dynamics. We develop a series of results, mostly due to Almeida and Costa and we also include some original results on the Schützenberger groups associated to a uniformly recurrent set.
متن کاملProfinite Groups Associated with Weakly Primitive Substitutions
A uniformly recurrent pseudoword is an element of a free profinite semigroup in which every finite factor appears in every sufficiently long finite factor. An alternative characterization is as a pseudoword which is a factor of all its infinite factors, that is one which lies in a J -class with only finite words strictly J -above it. Such a J -class is regular and therefore it has an associated...
متن کاملThe Equational Theory of Ω-terms for Finite R-trivial Semigroups∗
A new topological representation for free profinite R-trivial semigroups in terms of spaces of vertex-labeled complete binary trees is obtained. Such a tree may be naturally folded into a finite automaton if and only if the element it represents is an ω-term. The variety of ω-semigroups generated by all finite R-trivial semigroups, with the usual interpretation of the ω-power, is then studied. ...
متن کامل